| Definitions | t  T, x:A  B(x),  x:A. B(x), AbsInterface(A), s = t, x:A  B(x),  x:A. B(x), ES,  , E,  b, P   Q, P  Q, P & Q, P Q, Type,  , f(a), left + right, let x,y = A in B(x;y), t.1, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi ,  x.A(x), es-p-local-pred(es;P), e  X, X(e), {x:A| B(x)} , E(X), a:A fp B(a), strong-subtype(A;B), EqDecider(T), Unit, IdLnk, Id, EOrderAxioms(E; pred?; info), EState(T), Knd,  x. t(x), x,y. t(x;y), kindcase(k; a.f(a); l,t.g(l;t) ), Msg(M), type List,  ,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), e < e', r  s, constant_function(f;A;B), Top, ff, inr x , tt, inl x , True, A c B, es-interface-local-pred-bool, loc(e), kind(e), False, SWellFounded(R(x;y)), pred!(e;e'), <a, b>,  A, pred(e), first(e), last(P) |